Verifiable Distributed Aggregation Functions

نویسندگان

چکیده

The modern Internet is built on systems that incentivize collection of information about users. In order to minimize privacy loss, it desirable prevent these from collecting more than required for the application. promise multi-party computation data can be aggregated without revealing individual measurements collector. This work offers a provable security treatment "Verifiable Distributed Aggregation Functions (VDAFs)", class protocols being considered standardization by IETF. We propose formal framework analysis VDAFs and apply two constructions. first Prio3, one candidates standardization. VDAF based Prio system Corrigan-Gibbs Boneh (NSDI 2017). prove Prio3 achieves our goals with only minor changes draft. second construction, called Doplar, introduced this paper. Doplar round-reduced variant Poplar et al. (IEEE S&P 2021), itself candidate cost improvement modest increase in overall bandwidth computation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Construction of (Distributed) Verifiable Random Functions

We give the first simple and efficient construction of verifiable random functions (VRFs). VRFs, introduced by Micali et al. [MRV99], combine the properties of regular pseudorandom functions (PRFs) [GGM86] (i.e., indistinguishability from a random function) and digital signatures [GMR88] (i.e., one can provide an unforgeable proof that the VRF value is correctly computed). The efficiency of our...

متن کامل

Unique Aggregate Signatures with Applications to Distributed Verifiable Random Functions

The computation process of a Distributed Verifiable Random Function (DVRF) on some input specified by the user involves multiple, possibly malicious servers, and results in a publicly verifiable pseudorandom output to the user. Previous DVRF constructions assumed trusted generation of secret keys for the servers and imposed a threshold on the number of corrupted servers. In this paper we propos...

متن کامل

Verifiable Random Functions

We efficiently combine unpredictability and verifiability by extending the Goldreich–Goldwasser–Micali construction of pseudorandom functions fs from a secret seed s, so that knowledge of s not only enables one to evaluate fs at any point x, but also to provide an NP-proof that the value fs(x) is indeed correct without compromising the unpredictability of fs at any other point for which no such...

متن کامل

Weak Verifiable Random Functions

Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commitment to all values of the function and can then produce, for any input x, a proof that the function has been evaluated correctly on x, preserving pseudorandomness for all other inputs. No public-key (even a falsely g...

متن کامل

Constrained Verifiable Random Functions

We extend the notion of verifiable random functions (VRF) to constrained VRFs, which generalize the concept of constrained pseudorandom functions, put forward by Boneh and Waters (Asiacrypt’13), and independently by Kiayias et al. (CCS’13) and Boyle et al. (PKC’14), who call them delegatable PRFs and functional PRFs, respectively. In a standard VRF the secret key sk allows one to evaluate a pse...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings on Privacy Enhancing Technologies

سال: 2023

ISSN: ['2299-0984']

DOI: https://doi.org/10.56553/popets-2023-0126